منابع مشابه
The Complexity of Satisfiability for Fragments of CTL and CTL
The satisfiability problems for CTL and CTL? are known to be EXPTIME-complete, resp. 2EXPTIMEcomplete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that use less temporal or propositional operators, the complexity may decrease. This paper undertakes a systematic study of satisfiability for CTLand CTL?-formulae over restricted sets of propositional and temporal operator...
متن کاملErratum: The Complexity of Satisfiability for Fragments of CTL and CTL⋆
The satisfiability problems for CTL and CTL? are known to be EXPTIME-complete, resp. 2EXPTIMEcomplete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that use less temporal or propositional operators, the complexity may decrease. This paper undertakes a systematic study of satisfiability for CTLand CTL?-formulae over restricted sets of propositional and temporal operator...
متن کاملSatisfiability Games for CTL∗
This paper defines games for the full branching time logic CTL∗. They provide a direct method to check satisfiability of a formula since they work on its subformulas only. Thus, this method avoids determinisation of automata or translations into other logics. Instead, it employs a simple tool called focus which the players use to highlight one particular formula in a set of subformulas. Focus g...
متن کاملSatisfiability of CTL* with Constraints
We show that satisfiability for CTL∗ with equality-, order-, and modulo-constraints over Z is decidable. Previously, decidability was only known for certain fragments of CTL∗, e.g., the existential and positive fragments and EF.
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2009
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054109006954